Non-exhaustive connectives

نویسندگان

چکیده

Abstract This paper provides the first cross-linguistic study on non-exhaustive connectives. After defining non-exhaustivity and briefly exploring range of linguistic strategies encoding it across languages, methodology underlying will be discussed. Based analysis 35 for which at least one connective was found, argued that connectives exhibit quite homogenous distributional properties derive from a restricted set recurrent diachronic sources. Speakers are indeed likely to mobilize i ) elements already or implying non-exhaustivity, ii expressing an epistemic condition uncertainty, iii exemplification.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-exhaustive Parity Testing

In this paper, some new approaches are presented to deal with the dilemma we are facing in using parity testing: (1) proposing a method of turning a parity untestable circuit into parity testable (2) presenting a scheme of replacing the exhaustive testing with nonexhaustive way. The parity testing may resume its spirits by using some new technologies including the way presented here. I. Parity ...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Non-exhaustive, Overlapping k-means

Traditional clustering algorithms, such as k-means, output a clustering that is disjoint and exhaustive, that is, every single data point is assigned to exactly one cluster. However, in real datasets, clusters can overlap and there are often outliers that do not belong to any cluster. This is a well recognized problem that has received much attention in the past, and several algorithms, such as...

متن کامل

Reformulating Discourse Connectives for Non-Expert Readers

In this paper we report a behavioural experiment documenting that different lexicosyntactic formulations of the discourse relation of causation are deemed more or less acceptable by different categories of readers. We further report promising results for automatically selecting the formulation that is most appropriate for a given category of reader using supervised learning. This investigation ...

متن کامل

Non-deterministic Connectives in Propositional Godel Logic

We define the notion of a canonical Gödel system in the framework of single-conclusion hypersequent calculi. A corresponding general (nondeterministic) Gödel valuation semantics is developed, as well as a (non-deterministic) linear intuitionistic Kripke-frames semantics. We show that every canonical Gödel system induces a class of Gödel valuations (and of Kripke frames) for which it is strongly...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Language Typology and Universals

سال: 2022

ISSN: ['2196-7148', '1867-8319']

DOI: https://doi.org/10.1515/stuf-2022-1056